A study of connectivity on dynamic graphs: computing persistent connected components

This work focuses on connectivity in a dynamic graph. An undirected graph is defined finite and discrete time interval. Edges can appear disappear over time. The first objective of this to extend the notion connected component graphs new way. Persistent components are by their size, corresponding number vertices, length, consecutive steps they present on. second develop an algorithm computing largest, terms size persistent PICCNIC (PersIstent Connected CompoNent InCremental Algorithm) polynomial minimal complexity. Another advantage that it works online: knowing evolution not necessary execute it. implemented using GraphStream library experimented order carefully study outcome according different input types, as well real data networks, verify theoretical complexity, confirm its feasibility for large size.